Coherence as Constraint Satisfaction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coherence as Constraint Satisfaction

This paper provides a computational characterization of coherence that applies to a wide range of philosophical problems and psychological phenomena. Maximizing coherence is a matter of maximizing satisfaction of a set of positive and negative constraints. After comparing five algorithms for maximizing coherence, we show how our characterization of coherence overcomes traditional philosophical ...

متن کامل

Constraint Satisfaction as a

We present a method for the design of nonmasking fault-tolerant programs. In our method, a set of constraints is associated with each program. As long as faults do not occur, the constraints are continually satissed under the execution of program actions. Whenever some of the constraints are violated, due to certain faults, all constraints are eventually reestablished by subsequent execution of...

متن کامل

Lexical Acquisition as Constraint Satisfaction

In this paper we present a computational study of lexical acquisition. We attempt to characterize the lexical acquisition task faced by children by defining a simplified formal approximation of this task which we term the mapping problem. We then present a novel strategy for solving large instances of this mapping problem. This strategy is capable of learning the word-to-meaning mappings for as...

متن کامل

Connguration as Composite Constraint Satisfaction

Selecting and arranging parts is the core of a conngu-ration task. The validity of a connguration is deened in terms of constraints. Highly declarative, domain independent and simple to use, the constraint satisfaction problem (CSP) paradigm ooers an adequate framework for this task. However, the basic paradigm is not powerful enough to capture or to take advantage of essential aspects of conng...

متن کامل

Constraint Satisfaction as Global Optimization

We present a optimization formulation for discrete binary CSP, based on the construction of a continuous function A(P) whose global maximum represents the best possible solution for that problem. By the best possible solution we mean either (i) a solution of the problem, if it is solvable, or (ii) a partial solution violating a minimal number of constraints, if the problem is unsolvable. This a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cognitive Science

سال: 1998

ISSN: 0364-0213

DOI: 10.1207/s15516709cog2201_1